package 算法;



import java.util.HashSet;

/**
 * @author lo
 * @date 2021/11/8
 */
public class Text1 {
    public static void main(String[] args) {
        int arr[] ={0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,2,3,4,5};


        HashSet<Integer> integers = new HashSet<>();


        for (int i = 0; i < arr.length - 1; i++) {
            if (arr[i] ==0) {
                continue;
            }
            for (int j = 0; j < arr.length - 1; j++) {
                for (int k = 0; k < arr.length - 1; k++) {
                    int c = 0;
                    if (arr[i] != arr[k] && arr[j] != arr[k]) {
                        int num = arr[i]*100+arr[j]*10+arr[k];
                        integers.add(num);
                    }
                }
            }
        }
        System.out.println(integers);
    }
}
